A Benders Decomposition Algorithm for the Passenger Train Service Planning

Railway transport becomes a more popular transportation in many countries due to its large capacity, low energy consumption, and benign environment. The passenger train service planning is the key of rail operations system balance demand. In this paper, we propose mixed binary linear programming formulation for optimize route, frequency, stop schedule, assignment simultaneously. addition, analyze computational complexities model develop Benders decomposition algorithm with valid inequalities solve problem. Finally, our are tested on real-world instance Beijing-Shanghai high-speed railway line. results show that approach can these problems within reasonable solution time small optimality gaps (less than 2.5%).